List decoding codes on Garcia–Stictenoth tower using Gröbner basis
نویسندگان
چکیده
منابع مشابه
List decoding of Hermitian codes using Gröbner bases
List decoding of Hermitian codes is reformulated to allow an efcient and simple algorithm for the interpolation step. The algorithm is developed using the theory of Gr obner bases of modules. The computational complexity of the algorithm seems comparable to previously known algorithms achieving the same task, and the algorithm is better suited for hardware implementation.
متن کاملIterative list-decoding of Gabidulin codes via Gröbner based interpolation
We show how Gabidulin codes can be list decoded by using an iterative parametrization approach. For a given received word, our decoding algorithm processes its entries one by one, constructing four polynomials at each step. This then yields a parametrization of interpolating solutions for the data so far. From the final result a list of all codewords that are closest to the received word with r...
متن کاملList decoding of Reed-Solomon codes from a Gröbner basis perspective
The interpolation step of Guruswami and Sudan’s list decoding of Reed-Solomon codes poses the problem of finding the minimal polynomial of an ideal with respect to a certain monomial order. An efficient algorithm that solves the problem is presented based on the theory of Gröbner bases of modules. In a special case, this algorithm reduces to a simple Berlekamp-Massey-like decoding algorithm.
متن کاملDecoding Affine Variety Codes Using Gröbner Bases
We define a class of codes that we call affine variety codes. These codes are obtained by evaluating functions in the coordinate ring of an affine variety on all the Fq-rational points of the variety. We show that one can, at least in theory, decode these codes up to half the true minimum distance by using the theory of Gröbner bases. We extend results of A. B. Cooper and of X. Chen, I. S. Reed...
متن کاملList decoding algorithms based on Gröbner bases for general one-point AG codes
We generalize the list decoding algorithm for Hermitian codes proposed by Lee and O’Sullivan [18] based on Gröbner bases to general one-point AG codes, under an assumption weaker than one used by Beelen and Brander [4]. By using the same principle, we also generalize the unique decoding algorithm for one-point AG codes over the Miura-Kamiya Cab curves proposed by Lee, Bras-Amorós and O’Sullivan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2009
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2008.02.004